On complete-data spaces for PET reconstruction algorithms
نویسندگان
چکیده
منابع مشابه
On complete-data spaces for PET reconstruction algorithms
As investigators consider more comprehensive measurement models for emission tomography, there will be more choices for the complete-data spaces of the associated expectation-maximization (EM) algorithms for maximum-likelihood (ML) estimation. In this paper, we show that EM algorithms based on smaller complete-data spaces will typically converge faster. We discuss two practical applications of ...
متن کاملOn complete-data spaces for PET reconstruction algorithms - Nuclear Science, IEEE Transactions on
As investigators consider more comprehensive measurement models for emission tomography, there will be more choices for the complete-data spaces of the associated expectation-maximization (EM) algorithms for maximumlikelihood (ML) estimation. In this paper, we show that EM algorithms based on smaller complete-data spaces will typically converge faster. We discuss two practical applications of t...
متن کاملEpineural Sleeve Reconstruction Technique for Median Nerve Complete Transection
In microsurgical nerve repair, the epineural sleeve technique can be used to bridge short nerve defects and to coverthe coaptation site with the epineurium of the nerve stump. The epineurium serves as a mechanical aid to reducegap size, and increase repair strength, effectively assisting nerve regeneration.This article presents a 32-year-old patient who experienced complete transection of the m...
متن کاملThe influence of using different reconstruction algorithms on sensitivity of quantitative 18F-FDG-PET volumetric measures to background activity variation
Introduction: This study aims to investigate the influence of background activity variation on image quantification in differently reconstructed PET/CT images. Methods: Measurements were performed on a Discovery-690 PET/CT scanner using a custom-built NEMA-like phantom. A background activity level of 5.3 and 2.6 kBq/ml 18F-FDG were applied. Ima...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Nuclear Science
سال: 1993
ISSN: 0018-9499,1558-1578
DOI: 10.1109/23.256712